André Fuhrmann CONDITIONAL LOGICS AND CUMULATIVE LOGICS

نویسنده

  • André Fuhrmann
چکیده

Introduction Inference ivolving (so-called counterfactual) conditionals is a well-understood variety of nonmonotonic modes of reasoning. There is, accordingly , some prospect that by establishing links between logics of con-ditionals and varieties of nonmonotonic reasoning our understanding of the latter will improve. The purpose of this paper is to exhibit a close relationship between familiar conditional logics and a kind of nonmono-tonic reasoning recently studied under the name of cumulative inference by Kraus, Lehmann and Magidor (henceforward KLM). I refer the reader to KLM [1] for information concerning the origins and motivation of systems of cumulative inference. KLM claim (in [1, 170]) that the link between their work and previous work on conditional logic " is mainly at the level of the formal systems and not at the semantic level ". And indeed, the semantics of KLM does not seem to fit easily into the range of semantics offered for conditionals (see [2] or [3] for a survey). But while cumulative inference can be modeled in a way that contrasts with familiar semantics for conditionals, it need not be thus modeled. The link between cumulative and conditional logic is just as strong at the level of semantics as it is at the level of proof theory. Cumulative logics are based on a sentential language L with ∧ (conjunction) and ¬ (negation) chosen as primitive sentential connectives. There are two relations of inference between formulae: the straight turnstile, , denoting a familiar notion of deducibility, and a curly turnstile |∼, used for a nonmonotonic relation inference (cumulative inference). The following system CB emerges as a basis for all logics discussed in the context of cumulative inference; it is based on the classical sentential calculus and is closed under the rule of Modus Ponens.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Tableau Calculi for KLM Logics: extended version

We present tableau calculi for some logics of nonmonotonic reasoning, as defined by Kraus, Lehmann and Magidor. We give a tableau proof procedure for all KLM logics, namely preferential, loop-cumulative, cumulative and rational logics. Our calculi are obtained by introducing suitable modalities to interpret conditional assertions. We provide a decision procedure for the logics considered, and w...

متن کامل

Analytic Tableaux for KLM Preferential and Cumulative Logics

We present tableau calculi for some logics of default reasoning, as defined by Kraus, Lehmann and Magidor. We give a tableau proof procedure for preferential and cumulative logics. Our calculi are obtained by introducing suitable modalities to interpret conditional assertions. Moreover, they give a decision procedure for the respective logics and can be used to establish their complexity.

متن کامل

A Tableaux Calculus for KLM Preferential and Cumulative Logics

We present tableaux calculi for some logics of default reasoning, as defined by Kraus, Lehmann and Magidor. We give a tableaux proof procedure for preferential logic P and for loop-cumulative logic CL. Our calculi are obtained by introducing suitable modalities to interpret conditional assertions. Moreover, they give a decision procedure for the respective logics and can be used to establish th...

متن کامل

Nested Sequent Calculi and Theorem Proving for Normal Conditional Logics

In this paper we focus on proof methods and theorem proving for normal conditional logics, by describing nested sequent calculi as well as a theorem prover for them. Nested sequent calculi are a useful generalization of ordinary sequent calculi, where sequents are allowed to occur within sequents. Nested sequent calculi have been profitably employed in the area of (multi)-modal logic to obtain ...

متن کامل

Labelled Tableaux for Nonmonotonic Reasoning: Cumulative Consequence Relations

In this paper we present a labelled proof method for computing nonmonotonic consequence relations in a conditional logic setting. The method exploits the strong connection between these deductive relations and conditional logics, and it is based on the usual possible world semantics devised for the latter. The label formalism KEM, introduced to account for the semantics of normal modal logics, ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005